Application of ant colony optimisation in distribution transformer sizing
نویسندگان
چکیده
منابع مشابه
Ant Colony System-Based Algorithm for Optimal Multi-stage Planning of Distribution Transformer Sizing
This paper proposes a stochastic optimization method, based on ant colony optimization, for the optimal choice of transformer sizes to be installed in a distribution network. This method is properly introduced to the solution of the optimal transformer sizing problem, taking into account the constraints imposed by the load the transformer serves throughout its life time and the possible transfo...
متن کاملNiching for Ant Colony Optimisation
Evolutionary Computation niching methods, such as Fitness Sharing and Crowding, are aimed at simultaneously locating and maintaining multiple optima to increase search robustness, typically in multi-modal function optimization. Such methods have been shown to be useful for both single and multiple objective optimisation problems. Niching methods have been adapted in recent years for other optim...
متن کاملAnt Colony Algorithm Application in Economic Load Distribution
In this paper we try to introduce the Ant Colony Optimization (ACO) and its application in Economic Dispatch ED). In the step one we present theory and performance of ant colony and its history and its application in various applications and how work the ant colony algorithm. In step two we present ant colony optimization include Basic Concept, Ant Searching Behavior, Path Retracing and Pheromo...
متن کاملModel Checking the Ant Colony Optimisation
We present a model for the travelling salesman problem (TSP) solved using the ant colony optimisation (ACO), a bio-inspired mechanism that helps speed up the search for a solution and that can be applied to many other problems. The natural complexity of the TSP combined with the selforganisation and emergent behaviours that result from the application of the ACO make model-checking this system ...
متن کاملCandidate Set Strategies for Ant Colony Optimisation
Ant Colony Optimisation based solvers systematically scan the set of possible solution elements before choosing a particular one. Hence, the computational time required for each step of the algorithm can be large. One way to overcome this is to limit the number of element choices to a sensible subset, or candidate set. This paper describes some novel generic candidate set strategies and tests t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nigerian Journal of Technology
سال: 2018
ISSN: 2467-8821,0331-8443
DOI: 10.4314/njt.v36i4.33